Supervisor Reconfiguration for Deadlock Prevention by Resources Reallocation

نویسندگان

  • Miao Liu
  • ShouGuang Wang
  • ZhiWu Li
چکیده

Analysis and control of deadlocks play an important role in the design and operation of automated flexible manufacturing systems (FMSs). In FMS, deadlocks are highly undesirable situations, which always cause unnecessary cost. The design problem of an optimal supervisor is in general NP-hard. A computationally efficient method often ends up with a suboptimal one. This paper develops a deadlock prevention policy based on resources reallocation and supervisor reconfiguration. First, given a plant model, we reallocate the marking of each resource place to be one, obtaining a net model whose reachable states are much less than that of the original one. In this case, we find a controlled system for it by using the theory of regions. Next, the markings of the resource places in the controlled system are restored to their original ones.Without changing the structure of the obtained controlled system, we compute the markings of the monitors gradually, which can be realized by two algorithms proposed in this paper. Finally, we decide a marking for each monitor such that it makes the controlled system live with nearly optimal permissive behavior. Two FMS examples are used to illustrate the application of the proposed method and show its superior efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals

To avoid conflict and deadlock states in waterway with multiple locks and canals, a computer based traffic management system with proper control policy must be applied. The paper proposes a formal method for design of deadlock prevention supervisor by using discrete event theory, multiple reentrant flowlines class of Petri net and P-invariants control places calculation. By using and/or matrix ...

متن کامل

A deadlock-free dynamic reconfiguration protocol for distributed routing on interconnection networks

In interconnection networks, reconfiguration protocol is necessary to remap and reconnect the network paths, so that the network remains connected. However, the reconfiguration process brings the deadlock problem and prevention of deadlock is a tedious task in this situation. In existing works, very little work have considered deadlock problem and further, they paid no attention to reduce packe...

متن کامل

Optimal Qos-aware network reconfiguration in software defined cloud data centers

Software-defined networking (SDN) as a new paradigm for networking provides efficient resource reallocation platform in emerging cloud data center networks. The dynamic nature of cloud data center network's traffic, as well as the existence of big flows make it necessary to periodically reprogram the network through the SDN controller. Therefore, it is critical for network researchers to minimi...

متن کامل

DBR: A Simple, Fast and Efficient Dynamic Network Reconfiguration Mechanism Based on Deadlock Recovery Scheme

Dynamic network reconfiguration is described as the process of replacing one routing function with another while the network keeps running. The main challenge is avoiding deadlock anomalies while keeping limitations on message injection and forwarding minimal. Current approaches, whose complexity is so high that their practical applicability is limited, either require the existence of extra net...

متن کامل

Modular Supervisors for Deadlock Avoidance in Batch Processes

Petri net based models for plants and recipes are presented. The plant consists of processors and a transporting system connecting the processors. Processors are typically resources like reactors and tanks, while the transporting system consists of, for example, pipes, valves and pumps. Starting with these models we synthesize a discrete, modular supervisor which coordinates the concurrent exec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Mathematics

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013